By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 12, Issue 4, pp. 611-802

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Ranks of $m \times n \times (mn - 2)$ Tensors

M. D. Atkinson and S. Lloyd

pp. 611-615

BibTeX  Abstract Full Text:  PDF

Optimizing Conjunctive Queries that Contain Untyped Variables

D. S. Johnson and A. Klug

pp. 616-640

BibTeX  Abstract Full Text:  PDF

Fast Parallel Computation of Polynomials Using Few Processors

L. G. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff

pp. 641-644

BibTeX  Abstract Full Text:  PDF

Uniform Random Generation of Strings in a Context-Free Language

Timothy Hickey and Jacques Cohen

pp. 645-655

BibTeX  Abstract Full Text:  PDF

Authenticated Algorithms for Byzantine Agreement

D. Dolev and H. R. Strong

pp. 656-666

BibTeX  Abstract Full Text:  PDF

Analysis of Early-Insertion Standard Coalesced Hashing

Wen-Chin Chen and Jeffrey Scott Vitter

pp. 667-676

BibTeX  Abstract Full Text:  PDF

Varieties of "If-Then-Else"

Stephen L. Bloom and Ralph Tindell

pp. 677-707

BibTeX  Abstract Full Text:  PDF

On the Space and Time Complexity of Functions Computable by Simple Programs

Tat-Hung Chan and Oscar H. Ibarra

pp. 708-716

BibTeX  Abstract Full Text:  PDF

An Analysis of Backtracking with Search Rearrangement

Paul Walton Purdom, Jr. and Cynthia A. Brown

pp. 717-733

BibTeX  Abstract Full Text:  PDF

Convex Clusters in a Discrete $m$-Dimensional Space

John L. Pfaltz

pp. 734-750

BibTeX  Abstract Full Text:  PDF

New Results on the Complexity of $p$-Centre Problems

Nimrod Megiddo and Arie Tamir

pp. 751-758

BibTeX  Abstract Full Text:  PDF

Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

Nimrod Megiddo

pp. 759-776

BibTeX  Abstract Full Text:  PDF

The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

J. Scott Provan and Michael O. Ball

pp. 777-788

BibTeX  Abstract Full Text:  PDF

Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System

Debasis Mitra and J. A. Morrison

pp. 789-802

BibTeX  Abstract Full Text:  PDF